Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
نویسندگان
چکیده
منابع مشابه
Improved Sparse Multivariate Polynomial Interpolation Algorithms
We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to Ben-Or and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of...
متن کاملOn multivariate polynomial interpolation
We provide a map Θ 7→ ΠΘ which associates each finite set Θ of points in C with a polynomial space ΠΘ from which interpolation to arbitrary data given at the points in Θ is possible and uniquely so. Among all polynomial spaces Q from which interpolation at Θ is uniquely possible, our ΠΘ is of smallest degree. It is also Dand scale-invariant. Our map is monotone, thus providing a Newton form for...
متن کاملA new algorithm for sparse interpolation of multivariate polynomials
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables. Here we present a new technique, based on Rutishauser’s qd-algorithm, inwhichwe overcome both drawbacks. © 2008 Elsevier B.V. All rights reserved.
متن کاملInterpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
A function f : {0, 1} → {0, 1} is called t-sparse if the n-variable polynomial representation of f over GF (2) contains at most t monomials. Such functions are uniquely determined by their values at the so-called critical set of all binary n-tuples of Hamming weight ≥ n− ⌊log2 t⌋ − 1. An algorithm is presented for interpolating any t-sparse function f , given the values of f at the critical set...
متن کاملFaster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2016
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-016-0142-y